翻訳と辞書 Words near each other ・ Elliott-Meek House ・ Elliottdale ・ Elliotte Friedman ・ Elliotte Rusty Harold ・ Elliottia ・ Elliottia pyroliflora ・ Elliottia racemosa ・ Elliottinia ・ Elliotts of Newbury ・ Elliotts of Newbury Eon ・ Elliotts Primary EoN ・ Elliottstown, Illinois ・ Elliottville Lower Mill ・ Elliottville, Kentucky ・ Elliott–Carnegie Library ・ Elliott–Halberstam conjecture ・ Ellipanthus ・ Ellipanthus beccarii ・ Ellipanthus tomentosus ・ Elliphant ・ Ellipi ・ Ellipinion ・ Ellipostoma ・ Ellipsaria lineolata ・ Ellipse ・ Ellipse (album) ・ Ellipse (disambiguation) ・ Ellipse (manufacturer) ・ Ellipse Fuji ・ Ellipse Law Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Elliott–Halberstam conjecture ： ウィキペディア英語版 Elliott–Halberstam conjecture In number theory, the Elliott–Halberstam conjecture is a conjecture about the distribution of prime numbers in arithmetic progressions. It has many applications in sieve theory. It is named for Peter D. T. A. Elliott and Heini Halberstam, who stated the conjecture in 1968. To state the conjecture requires some notation. Let $\backslash pi(x)$ denote the number of primes less than or equal to ''x''. If ''q'' is a positive integer and ''a'' is coprime to ''q'', we let $\backslash pi(x;q,a)$ denote the number of primes less than or equal to ''x'' which are equal to ''a'' modulo ''q''. Dirichlet's theorem on primes in arithmetic progressions then tells us that :$\backslash pi(x;q,a)\; \backslash approx\; \backslash frac$ where ''a'' is coprime to ''q'' and $\backslash varphi$ is Euler's totient function. If we then define the error function :$E(x;q)\; =\; \backslash max\_\; \backslash left|\backslash pi(x;q,a)\; -\; \backslash frac\backslash right|$ where the max is taken over all ''a'' coprime to ''q'', then the Elliott–Halberstam conjecture is the assertion that for every ''θ'' < 1 and ''A'' > 0 there exists a constant ''C'' > 0 such that :$\backslash sum\_\; E(x;q)\; \backslash leq\; \backslash frac$ for all ''x'' > 2. This conjecture was proven for all ''θ'' < 1/2 by Enrico Bombieri and A. I. Vinogradov〔 Corrigendum. ibid. 30 (1966), pages 719-720. (Russian)〕 (the Bombieri–Vinogradov theorem, sometimes known simply as "Bombieri's theorem"); this result is already quite useful, being an averaged form of the generalized Riemann hypothesis. It is known that the conjecture fails at the endpoint ''θ'' = 1. The Elliott–Halberstam conjecture has several consequences. One striking one is the result announced by Dan Goldston, János Pintz, and Cem Yıldırım,〔; see also , .〕 which shows (assuming this conjecture) that there are infinitely many pairs of primes which differ by at most 16. In November 2013, James Maynard showed that subject to the Elliott–Halberstam conjecture, one can show the existence of infinitely many pairs of consecutive primes that differ by at most 12. In August 2014, Polymath group showed that subject to the generalized Elliott–Halberstam conjecture, one can show the existence of infinitely many pairs of consecutive primes that differ by at most 6. Without assuming any form of the conjecture, the lowest proven bound is 246. ==See also== *Barban–Davenport–Halberstam theorem *Barban–Montgomery theorem *Siegel–Walfisz theorem 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Elliott–Halberstam conjecture」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.